Handling Execution Overruns in Hard Real-Time Control Systems

نویسندگان

  • Marco Caccamo
  • Giorgio C. Buttazzo
  • Lui Sha
چکیده

ÐIn many real-time control applications, the task periods are typically fixed and worst-case execution times are used in schedulability analysis. With the advancement of robotics, flexible visual sensing using cameras has become a popular alternative to the use of embedded sensors. Unfortunately, the execution time of visual tracking varies greatly. In such environments, control tasks have a normally short computation time, but also an occasional long computation time; therefore, the use of worst-case execution time is inefficient for control performance optimization. Nevertheless, to maintain the control stability, we still need to guarantee the schedulability of the task set, even if the worst case arises. In this paper, we propose an integrated approach to control performance optimization and task scheduling for control applications where the execution time of each task can vary greatly. We present an innovative approach to overrun management that allows us to fully utilize the processor for optimizing the control performance and yet guaranteeing the schedulability of all tasks under worst-case conditions. Index TermsÐOverrun management, rate adaptation, real-time scheduling.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementing and Using Execution Time Clocks in Ada Hard Real-Time Applications

1. Off-line analysis techniques for hard real-time systems are all based on the assumption that we can estimate the worst-case execution time of the different tasks executing in the system. In the traditional cyclic-executive schedulers, execution time limits were enforced for each task by the scheduler. Unfortunately, in concurrent hard real-time systems such as those using the tasking model d...

متن کامل

Robust Partitioned Scheduling for Real-Time Multiprocessor Systems

In this paper, we consider the problem of fixed-priority partitioned scheduling of sporadic real-time tasks for homogeneous processors. We propose a partitioning heuristic that takes into account possible Worst Case Execution Time (WCET) overruns. Our goal is to maximize the duration a task can be allowed to exceed its WCET without compromising the timeliness constraints of all the tasks. This ...

متن کامل

Real-Time Operating Systems: Problems and Novel Solutions

This work presents some methodologies for enhancing predictability in real-time computing systems, where explicit timing constraints have to be enforced on application processes. In order to provide an off-line guarantee of the critical timing constraints, deterministic and analyzable algorithms are required in all kernel mechanisms, especially involving scheduling, inter-task communication, sy...

متن کامل

Data Management for Real-Time Systems

Alejandro Buchmann, TH Darmstadt Timeliness of execution is part of the correctness criterion in a variety of application domains, such as air-traffic control, CIM, or network control. To achieve real-time behavior in a DBMS it is necessary to develop new approaches to transaction scheduling, to the analysis of a transaction’s execution time, the interplay between the DBMS and the (real-time) o...

متن کامل

Implementing adaptive time-triggered co-operative scheduling framework for highly-predictable embedded systems

For many real-time embedded systems, Time-Triggered Co-operative (TTC) scheduling algorithms provide simple and reliable solution at low cost. Previous work in this area has focused on the development of a wide range of TTC implementations for various purposes (e.g. for achieving low-jitter characteristics, reducing CPU power consumption or dealing with task-overruns). Despite the great deal of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 51  شماره 

صفحات  -

تاریخ انتشار 2002